#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

// 3413. 收集连续 K 个袋子可以获得的最多硬币数量
// https://leetcode.cn/problems/maximum-coins-from-k-consecutive-bags/description/

class Solution {
public:
    long long maximumCoins(vector<vector<int>>& coins, int k) {
        sort(coins.begin(), coins.end());
        int ans = 0;
        int curConNum = 0;
        int left = 0;
        int leftIndex = coins[0][0];
        for (int i = 0; i < coins.size(); i++)
        {
            
        }
    }
};


int main(){
    return 0;
}